Fast Estimation of tr(f(A)) via Stochastic Lanczos Quadrature

نویسندگان

  • Shashanka Ubaru
  • Jie Chen
  • Yousef Saad
چکیده

The problem of estimating the trace of matrix functions appears in applications ranging from machine learning, to scientific computing, and computational biology to name just a few. This paper presents an inexpensive method to estimate the trace of f(A) for cases where f is analytic inside a closed interval. The method combines three key ingredients, namely, the stochastic trace estimator, Gaussian quadrature, and the Lanczos algorithm. As examples, we consider the problems of estimating the log-determinant (f(t) = log(t)), the Schatten p-norms (f(t) = tp/2), the Estrada index (f(t) = et) and the trace of a matrix inverse (f(t) = 1 t ). We establish multiplicative and additive error bounds for the approximations obtained by the method. In addition, we present error bounds for other useful tools such as approximating the log-likelihood function in the context of maximum likelihood estimation of Gaussian processes. Numerical experiments illustrate the performance of the proposed method on different problems arising from various applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of trace estimation techniques

We discuss various applications of trace estimation techniques for evaluating functions of the form tr(f(A)) where f is certain function. The first problem we consider that can be cast in this form is that of approximating the Spectral density or Density of States(DOS) of a matrix. The DOS is a probability density distribution that measures the likelihood of finding eigenvalues of the matrix at...

متن کامل

Bounding matrix functionals via partial global block Lanczos decomposition

Approximations of expressions of the form If := trace(W T f(A)W ), where A ∈ Rm×m is a large symmetric matrix, W ∈ Rm×k with k ≪ m, and f is a function, can be computed without evaluating f(A) by applying a few steps of the global block Lanczos method to A with initial block-vector W . This yields a partial global Lanczos decomposition of A. We show that for suitable functions f upper and lower...

متن کامل

Matrices, Moments, and Rational Quadrature

Abstract. Many problems in science and engineering require the evaluation of functionals of the form Fu(A) = uT f(A)u, where A is a large symmetric matrix, u a vector, and f a nonlinear function. A popular and fairly inexpensive approach to determining upper and lower bounds for such functionals is based on first carrying out a few steps of the Lanczos procedure applied to A with initial vector...

متن کامل

Fast Computation of Spectral Densities for Generalized Eigenvalue Problems

The distribution of the eigenvalues of a Hermitian matrix (or of a Hermitian matrix pencil) reveals important features of the underlying problem, whether a Hamiltonian system in physics, or a social network in behavioral sciences. However, computing all the eigenvalues explicitly is prohibitively expensive for real-world applications. This paper presents two types of methods to efficiently esti...

متن کامل

Block Gauss and Anti-Gauss Quadrature with Application to Networks

Approximations of matrix-valued functions of the form WT f(A)W , where A ∈ Rm×m is symmetric, W ∈ Rm×k , with m large and k m, has orthonormal columns, and f is a function, can be computed by applying a few steps of the symmetric block Lanczos method to A with initial block-vector W ∈ Rm×k . Golub and Meurant have shown that the approximants obtained in this manner may be considered block Gauss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 38  شماره 

صفحات  -

تاریخ انتشار 2017